A simple non-termination test for the Knuth-Bendix method
Identifieur interne : 00E858 ( Main/Exploration ); précédent : 00E857; suivant : 00E859A simple non-termination test for the Knuth-Bendix method
Auteurs : David A. Plaisted [États-Unis]Source :
- Lecture Notes in Computer Science [ 0302-9743 ]
Abstract
Abstract: We propose a simple test for nontermination in the Knuth-Bendix completion algorithm. This test has the property that if there exists a simplification ordering that can generate a completion S of a set R of rules, then S may be generated from R using this test. Also, this test is “user friendly” in that it does not require any detailed knowledge of termination orderings. However, this technique may generate completions S that are not terminating; therefore, traditional methods for proving termination need to be used on the locally confluent sets S of rewrite rules that are obtained. We show that this test may be implemented in reasonable time and space bounds.
Url:
DOI: 10.1007/3-540-16780-3_81
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 001F33
- to stream Istex, to step Curation: 001F08
- to stream Istex, to step Checkpoint: 003644
- to stream Main, to step Merge: 00F146
- to stream Main, to step Curation: 00E858
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">A simple non-termination test for the Knuth-Bendix method</title><author><name sortKey="Plaisted, David A" sort="Plaisted, David A" uniqKey="Plaisted D" first="David A." last="Plaisted">David A. Plaisted</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:87258905EC28522BA69958B65787F7DCEA88D034</idno><date when="1986" year="1986">1986</date><idno type="doi">10.1007/3-540-16780-3_81</idno><idno type="url">https://api.istex.fr/ark:/67375/HCB-KDF8042V-R/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">001F33</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001F33</idno><idno type="wicri:Area/Istex/Curation">001F08</idno><idno type="wicri:Area/Istex/Checkpoint">003644</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">003644</idno><idno type="wicri:doubleKey">0302-9743:1986:Plaisted D:a:simple:non</idno><idno type="wicri:Area/Main/Merge">00F146</idno><idno type="wicri:Area/Main/Curation">00E858</idno><idno type="wicri:Area/Main/Exploration">00E858</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">A simple non-termination test for the Knuth-Bendix method</title><author><name sortKey="Plaisted, David A" sort="Plaisted, David A" uniqKey="Plaisted D" first="David A." last="Plaisted">David A. Plaisted</name><affiliation wicri:level="2"><country xml:lang="fr">États-Unis</country><placeName><region type="state">Caroline du Nord</region></placeName><wicri:cityArea>Department of Computer Science, University of North Carolina at Chapel Hill, 27514, Chapel Hill</wicri:cityArea></affiliation></author></analytic><monogr></monogr><series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title><title level="s" type="abbrev">Lect Notes Comput Sci</title><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: We propose a simple test for nontermination in the Knuth-Bendix completion algorithm. This test has the property that if there exists a simplification ordering that can generate a completion S of a set R of rules, then S may be generated from R using this test. Also, this test is “user friendly” in that it does not require any detailed knowledge of termination orderings. However, this technique may generate completions S that are not terminating; therefore, traditional methods for proving termination need to be used on the locally confluent sets S of rewrite rules that are obtained. We show that this test may be implemented in reasonable time and space bounds.</div></front></TEI><affiliations><list><country><li>États-Unis</li></country><region><li>Caroline du Nord</li></region></list><tree><country name="États-Unis"><region name="Caroline du Nord"><name sortKey="Plaisted, David A" sort="Plaisted, David A" uniqKey="Plaisted D" first="David A." last="Plaisted">David A. Plaisted</name></region></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 00E858 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 00E858 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:87258905EC28522BA69958B65787F7DCEA88D034
|texte= A simple non-termination test for the Knuth-Bendix method
}}
| This area was generated with Dilib version V0.6.33. |  |